Dynamics of centrality measures of random graph mathematical models
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولSimulation of Pedestrian Dynamics with Macroscopic and Microscopic Mathematical Models
Here, we collect two parts of a research project on the pedestrian flow modeling. Rapid growth in the volume of public transport and the need for its reasonable, efficient planning have made the description and modeling of transport and pedestrian behaviors as important research topics in the past twenty years. First, we present a macroscopic model for the pedestrian flow based on continuum mec...
متن کاملMaximal-entropy random walk unifies centrality measures
This paper compares a number of centrality measures and several (dis-)similarity matrices with which they can be defined. These matrices, which are used among others in community detection methods, represent quantities connected to enumeration of paths on a graph and to random walks. Relationships between some of these matrices are derived in the paper. These relationships are inherited by the ...
متن کاملLecture 12 : Random Walks and Graph Centrality
We now present a different type of connection between graphs and eigenvalues. In several applications, we wish to find influential vertices in a graph. For instance, suppose we model Twitter as a directed graph where there is an edge from user i to user j if i follows j. Then how can we measure importance of a user in the graph? One way of measuring it is look at the in-degree of a user, or the...
متن کاملA Comparison of Centrality Measures for Graph-Based Keyphrase Extraction
In this paper, we present and compare various centrality measures for graphbased keyphrase extraction. Through experiments carried out on three standard datasets of different languages and domains, we show that simple degree centrality achieve results comparable to the widely used TextRank algorithm, and that closeness centrality obtains the best results on short documents.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific and Technical Journal of Information Technologies, Mechanics and Optics
سال: 2020
ISSN: 2226-1494
DOI: 10.17586/2226-1494-2020-20-2-249-256